Median and quasi-median direct products of graphs
نویسندگان
چکیده
منابع مشابه
Median and quasi-median direct products of graphs
Median graphs are characterized among direct products of graphs on at least three vertices. Beside some trivial cases, it is shown that one component of G × P3 is median if and only if G is a tree in that the distance between any two vertices of degree at least 3 is even. In addition, some partial results considering median graphs of the form G ×K2 are proved, and it is shown that the only nonb...
متن کاملOn Median Graphs and Median Grid Graphs on Median Graphs and Median Grid Graphs
Let e be an edge of a median graph G which is contained in exactly one 4-cycle. Then it is proved that G n e is a median graph. The converse holds as well provided that e is not contained is a subgraph isomorphic to the 3-cube minus a vertex. These results are used to give several characterizations of median grid graphs. (Grid graphs are subgraphs of complete grids, i.e. of the Cartesian produc...
متن کاملOn median graphs and median grid graphs
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djoković-Winkler’s relation Θ and let h be the number of Q3’s in G. Then we prove that 2n −m − k + h = 2. We also characterize median grid graphs in several different ways, for instance, they are the grid graphs with m− n + 1 squares. To obtain these results we introduce the notion of square...
متن کاملRelations between Median Graphs, Semi-median Graphs and Partial Cubes
A rich structure theory has been developed in the last three decades for graphs embed dable into hypercubes in particular for isometric subgraphs of hypercubes also known as partial cubes and for median graphs Median graphs which constitute a proper subclass of partial cubes have attracted considerable attention In order to better understand them semi median graphs have been introduced but have...
متن کاملQuasi-median graphs, their generalizations, and tree-like equalities
Three characterizations of quasi-median graphs are proved, for instance, they are partial Hamming graphs without convex house and convexQ 3 such that certain relations on their edge sets coincide. Expansion procedures, weakly 2-convexity, and several relations on the edge set of a graph are essential for these results. Quasisemimedian graphs are characterized which yields an additional characte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2005
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1271